Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
نویسندگان
چکیده
منابع مشابه
Optimal locally repairable codes via elliptic curves
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg [14] first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, q-ary optimal locally repairable codes from subcodes of Reed-Solomon codes giv...
متن کاملOptimal locally repairable codes of distance 3 and 4 via cyclic codes
Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of [14], several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given in [14] are upper bounded by the code alphabet...
متن کاملLocally Repairable Regenerating Code Constructions
In this work, we give locally repairable regenerating code (LRRC) [1]–[4] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidthregenerating (MBR) point. I. RANDOM LINEAR CODE CONSTRUCTION FOR A CLASS OF (n, k, d, r) PARAMETERS In this section, we prove the existence and construction of linea...
متن کاملOptimal Locally Repairable Systematic Codes Based on Packings
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, we first build a bridge between locally repairable code and packing. As an application of this bridge, some optimal locally repairable codes can be obtained by packings, which gives optimal locally repairable codes with flexible parameters. Index Terms Distributed storage, loc...
متن کاملOptimal binary linear locally repairable codes with disjoint repair groups
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However, most known constructions are over large fields with sizes close to the code length, which lead to the systems computationally expensive. Due to this, binary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2761120